Stratified negation in temporal logic programming and the cycle-sum test

Stratified negation in temporal logic programming and the cycle-sum test

We consider stratiied negation in temporal logic programming. We demonstrate that the cycle sum test (which was initially proposed for detecting deadlocks in the context of temporal functional programming) can also be used as a syntactic stratiication test for temporal logic programming. Therefore, on the one hand we exhibit a class of temporal logic programs with negation which have a well-dee...

Negation Without Negation in Probabilistic Logic Programming

Probabilistic logic programs without negation can have cycles (with a preference for false), but cannot represent all conditional distributions. Probabilistic logic programs with negation can represent arbitrary conditional probabilities, but with cycles they create logical inconsistencies. We show how allowing negative noise probabilities allows us to represent arbitrary conditional probabilit...

5.2 Negation in Logic Programming

43 negated predicate calls must be executed as an indivisible operation, with only a true/false answer. Constructive negation 1, 18, 25, 37, 38] is an alternative implementation which allows negated predicate calls to produce more informative answers. Program transformations, when they are applicable, can allow execution of negated predicate calls which incrementally produce informative answers...

Negation and Constraint Logic Programming

Almost all constraint logic programming systems include negation, yet nowhere has a sound operational model for negation in CLP been discussed. The SLDNF approach of only allowing ground negative subgoals to execute is very restrictive in constraint logic programming where most variables appearing in a derivation never become ground. By describing a scheme for constructive negation in constrain...

Implicit and Explicit Negation in Logic Programming